| partial class DIGRAPH_INCL{NTP} < $DIGRAPH{NTP} |
|---|
| $DIGRAPH{_} | $RO_DIGRAPH{_} | $GRAPH{_,_} | $STR | $ELT{_} | $ELT | RO_DIGRAPH_INCL{_} |
| DIGRAPH_REV_DIGRAPH_VIEW{_,_} | DIGRAPH_REV_DIGRAPH_VIEW{_} | DIGRAPH{_} | LBLD_DIGRAPH{_,_,_} | WTD_DIGRAPH{_,_} |
| stub add_node(n: NTP): NTP; |
|---|
| stub add_node: NTP; |
|---|
| stub connect(e: DIEDGE{NTP}); |
|---|
| connect(f,s: NTP) |
|---|
| connect(f,s: NTP): SAME |
|---|
| copy: $DIGRAPH{NTP} .. Included as copy |
|---|
| stub delete_node(n: NTP); |
|---|
| stub disconnect(e: DIEDGE{NTP}); |
|---|
| disconnect(f,s: NTP) |
|---|
| equals(g: $RO_DIGRAPH{NTP}):BOOL .. Included as equals |
|---|
| **** | True if both have the same set of nodes and edges |
| has(n: NTP): BOOL .. Included as has |
|---|
| stub has_edge(e: DIEDGE{NTP}): BOOL; .. Included as has_edge |
|---|
| stub has_node(n: NTP): BOOL; .. Included as has_node |
|---|
| is_empty: BOOL .. Included as is_empty |
|---|
| n_adjacent(n:NTP): INT .. Included as n_adjacent |
|---|
| stub n_edges: INT; .. Included as n_edges |
|---|
| stub n_incoming(n: NTP): INT; .. Included as n_incoming |
|---|
| stub n_nodes: INT; .. Included as n_nodes |
|---|
| stub n_outgoing(n: NTP): INT; .. Included as n_outgoing |
|---|
| size: INT .. Included as size |
|---|
| str: STR .. Included as str |
|---|
| **** | Print out the graph using the bound routine "f" for the nodes |
| adjacent!(once n: NTP): NTP .. Included as adjacent! |
|---|
| **** | Adjacent is aliased to "outgoing" |
| stub edge!: DIEDGE{NTP}; .. Included as edge! |
|---|
| elt!: NTP .. Included as elt! |
|---|
| **** | Returns the nodes of the graph |
| stub incoming!(once n: NTP): NTP; .. Included as incoming! |
|---|
| stub node!: NTP; .. Included as node! |
|---|
| stub outgoing!(once n: NTP): NTP; .. Included as outgoing! |
|---|
| node_str(n: NTP): STR .. Included as node_str |
|---|
| **** | There should not be void nodes in the graph! |